Refining Queries on a Treebank with XSLT Filters. Approaching the Universal Quantifier
نویسنده
چکیده
This paper discusses the use of XSLT stylesheets as a filtering mechanism for refining the results of user queries on treebanks. The discussion is within the context of the TIGER treebank, the associated search engine and query language, but the general ideas can apply to any search engine for XML-encoded treebanks. It will be shown that important classes of linguistic phenomena can be accessed by applying relatively simple XSLT templates to the output of a query, effectively simulating the universal quantifier for a subset of the query language.
منابع مشابه
On residuated lattices with universal quantifiers
We consider properties of residuated lattices with universal quantifier and show that, for a residuated lattice $X$, $(X, forall)$ is a residuated lattice with a quantifier if and only if there is an $m$-relatively complete substructure of $X$. We also show that, for a strong residuated lattice $X$, $bigcap {P_{lambda} ,|,P_{lambda} {rm is an} m{rm -filter} } = {1}$ and hence that any strong re...
متن کاملAn annotation scheme for Persian based on Autonomous Phrases Theory and Universal Dependencies
A treebank is a corpus with linguistic annotations above the level of the parts of speech. During the first half of the present decade, three treebanks have been developed for Persian either originally or subsequently based on dependency grammar: Persian Treebank (PerTreeBank), Persian Syntactic Dependency Treebank, and Uppsala Persian Dependency Treebank (UPDT). The syntactic analysis of a sen...
متن کاملDisambiguating quantifier scope in DTS
This paper proposes an extension of Dependency Tree Semantics (DTS), an underspecified logic originally proposed in [20], that uniformily implements constraints on Nested Quantification, Island Constraints and logical Redundancy. Unfortunately, this extension makes the complexity exponential in the number of NPs, in the worst cases. Nevertheless, we conducted an experiment on the Turin Universi...
متن کاملQuery Translation from XSLT to SQL
XML has been accepted as a universal format for data interchange and publication. It can be applied in the applications in which the data of a database needs to be viewed in XML format so that the data being viewed takes more semantics and is easily understood. In these applications, the user of the data to be viewed sees only XML data, not the database. He may use XML query languages such as X...
متن کاملApproximate Quantifier Elimination for Propositional Boolean Formulae
This paper describes an approximate quantifier elimination procedure for propositional Boolean formulae. The method is based on computing prime implicants using SAT and successively refining overapproximations of a given formula. This construction naturally leads to an anytime algorithm, that is, it can be interrupted at anytime without compromising soundness. This contrasts with classical mono...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005